The Golem Horn Solver

Abstract The logical framework of Constrained Horn Clauses (CHC) models verification tasks from a variety domains, ranging safety properties in transition systems to modular programs with procedures. In this work we present Golem , flexible and efficient solver for satisfiability CHC over linear real integer arithmetic. provides flexibility architecture multiple back-end model-checking algorithms, as well efficiency tight integration the underlying SMT solver. This paper describes its engines, which include our recently introduced algorithm TPA deep exploration. description is complemented by extensive evaluation, demonstrating competitive nature